A note on the Tu-Deng conjecture
نویسندگان
چکیده
DOI: 10.1007/s11424-015-2240-3 Received: 8 November 2012 / Revised: 1 July 2014 c ©The Editorial Office of JSSC & Springer-Verlag Berlin Heidelberg 2015 Abstract Let k be a positive integer. For any positive integer x = ∑∞ i=0 xi2 , where xi = 0, 1, we define the weight w(x) of x by w(x) := ∑∞ i=0 xi. For any integer t with 0 < t < 2 k − 1, let St := {(a, b) ∈ Z2|a+ b ≡ t (mod 2 − 1), w(a)+w(b) < k, 0 ≤ a, b ≤ 2 − 2}. This paper gives explicit formulas for cardinality of St in the cases of w(t) ≤ 3 and an upper bound for cardinality of St when w(t) = 4. From this one then concludes that a conjecture proposed by Tu and Deng in 2011 is true if w(t) ≤ 4.
منابع مشابه
A Note on a Combinatorial Conjecture
It is difficult to find Boolean functions achieving many good cryptographic properties. Recently, Tu and Deng obtained two classes of Boolean functions with good properties based on a combinatorial conjecture about binary strings. In this paper, using different approaches, we prove this conjecture is true in some cases. This conjecture has resisted different attempts of proof since it is hard t...
متن کاملOn a Combinatorial Conjecture of Tu and Deng
Recently, Tu and Deng obtained two classes of Boolean functions with nice properties based on a combinatorial conjecture about binary strings. In this paper, using different approaches, we prove this conjecture is true in several cases.
متن کاملA note on Fouquet-Vanherpe’s question and Fulkerson conjecture
The excessive index of a bridgeless cubic graph $G$ is the least integer $k$, such that $G$ can be covered by $k$ perfect matchings. An equivalent form of Fulkerson conjecture (due to Berge) is that every bridgeless cubic graph has excessive index at most five. Clearly, Petersen graph is a cyclically 4-edge-connected snark with excessive index at least 5, so Fouquet and Vanherpe as...
متن کامل# a 17 Integers 11 ( 2011 ) on a Combinatorial Conjecture
Recently, Tu and Deng proposed a combinatorial conjecture about binary strings, and, on the assumption that the conjecture is correct, they obtained two classes of Boolean functions which are both algebraic immunity optimal, the first of which are also bent functions. The second class gives balanced functions, which have optimal algebraic degree and the best nonlinearity known up to now. In thi...
متن کاملOn a Combinatorial Conjecture
Recently, Tu and Deng [3] proposed a combinatorial conjecture about binary strings, and, on the assumption that the conjecture is correct, they obtained two classes of Boolean functions which are both algebraic immunity optimal, the first of which are also bent functions. The second class gives balanced functions, which have optimal algebraic degree and the best nonlinearity known up to now. In...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Systems Science & Complexity
دوره 28 شماره
صفحات -
تاریخ انتشار 2015